翻訳と辞書 Words near each other ・ Markov additive process ・ Markov algorithm ・ Markov blanket ・ Markov brothers' inequality ・ Markov chain ・ Markov chain approximation method ・ Markov chain geostatistics ・ Markov chain mixing time ・ Markov chain Monte Carlo ・ Markov chains on a measurable state space ・ Markov decision process ・ Markov information source ・ Markov kernel ・ Markov logic network ・ Markov model ・ Markov number ・ Markov partition ・ Markov perfect equilibrium ・ Markov process ・ Markov Processes International ・ Markov property ・ Markov random field ・ Markov renewal process ・ Markov reward model ・ Markov Reward Model Checker ・ Markov spectrum ・ Markov strategy ・ Markov switching multifractal ・ Markov tree ・ Markov's inequality Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Markov number ： ウィキペディア英語版 Markov number A Markov number or Markoff number is a positive integer ''x'', ''y'' or ''z'' that is part of a solution to the Markov Diophantine equation :$x^2\; +\; y^2\; +\; z^2\; =\; 3xyz,\backslash ,$ studied by . The first few Markov numbers are :1, 2, 5, 13, 29, 34, 89, 169, 194, 233, 433, 610, 985, 1325, ... appearing as coordinates of the Markov triples :(1, 1, 1), (1, 1, 2), (1, 2, 5), (1, 5, 13), (2, 5, 29), (1, 13, 34), (1, 34, 89), (2, 29, 169), (5, 13, 194), (1, 89, 233), (5, 29, 433), (1, 233, 610), (89, 233, 62210), etc. There are infinitely many Markov numbers and Markov triples. == Markov tree == There are two simple ways to obtain a new Markov triple from an old one (''x'', ''y'', ''z''). First, one may permute the 3 numbers ''x'',''y'',''z'', so in particular one can normalize the triples so that ''x'' ≤ ''y'' ≤ ''z''. Second, if (''x'', ''y'', ''z'') is a Markov triple then by Vieta jumping so is (''x'', ''y'', 3''xy'' − ''z''). Applying this operation twice returns the same triple one started with. Joining each normalized Markov triple to the 1, 2, or 3 normalized triples one can obtain from this gives a graph starting from (1,1,1) as in the diagram. This graph is connected; in other words every Markov triple can be connected to (1,1,1) by a sequence of these operations.〔Cassels (1957) p.28〕 If we start, as an example, with (1, 5, 13) we get its three neighbors (5, 13, 194), (1, 13, 34) and (1, 2, 5) in the Markov tree if ''x'' is set to 1, 5 and 13, respectively. For instance, starting with (1, 1, 2) and trading ''y'' and ''z'' before each iteration of the transform lists Markov triples with Fibonacci numbers. Starting with that same triplet and trading ''x'' and ''z'' before each iteration gives the triples with Pell numbers. All the Markov numbers on the regions adjacent to 2's region are odd-indexed Pell numbers (or numbers ''n'' such that 2''n''2 − 1 is a square, ), and all the Markov numbers on the regions adjacent to 1's region are odd-indexed Fibonacci numbers (). Thus, there are infinitely many Markov triples of the form :$(1,\; F\_,\; F\_),\backslash ,$ where ''F''''x'' is the ''x''th Fibonacci number. Likewise, there are infinitely many Markov triples of the form :$(2,\; P\_,\; P\_),\backslash ,$ where ''P''''x'' is the ''x''th Pell number.〔 lists Markov numbers that appear in solutions where one of the other two terms is 5.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Markov number」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.